A Gaussian limit process for optimal FIND algorithms

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Gaussian limit process for optimal FIND algorithms

We consider versions of the FIND algorithm where the pivot element used is the median of a subset chosen uniformly at random from the data. For the median selection we assume that subsamples of size asymptotic to c · n are chosen, where 0 < α ≤ 12 , c > 0 and n is the size of the data set to be split. We consider the complexity of FIND as a process in the rank to be selected and measured by the...

متن کامل

Gaussian Process Models of Spatial Aggregation Algorithms

Multi-level spatial aggregates are important for data mining in a variety of scientific and engineering applications, from analysis of weather data (aggregating temperature and pressure data into ridges and fronts) to performance analysis of wireless systems (aggregating simulation results into configuration space regions exhibiting particular performance characteristics). In many of these appl...

متن کامل

Efficient Algorithms to Find Optimal Agent Migration Strategies

Mobile agent technology has received a rapidly growing attention over the last few years. A number of mobile agent systems are under development in academic as well as industrial environments, there are already various moves to popularize and standardize mobile agent facilities and architectures. It has been argued that mobile agents provide certain advantages as compared to traditional approac...

متن کامل

Optimal Multigrid Algorithms for Variable-Coupling Isotropic Gaussian Models

A novel class of multigrid algorithms for the variable coupling isotropic Gaussian models is presented In addition to the elimination of the critical slowing down which otherwise might become much worse than usual in the case of strongly varying coupling values the vol ume factor is also eliminated That is the need to produce many independent ne grid con gurations for averaging out their statis...

متن کامل

Using Monotonicity to Find Optimal Process Configurations Faster

Configurable process models can be used to encode a multitude of (different) process models. After configuration, they can be used to support the execution of a particular process. A configurable process model represents a space of instantiations (configured process variants). Such an instantiation space can be used by an organisation to select the best instantiation(s) according to some Key Pe...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronic Journal of Probability

سال: 2014

ISSN: 1083-6489

DOI: 10.1214/ejp.v19-2933